Extended visual cryptography schemes
نویسندگان
چکیده
منابع مشابه
Extended visual cryptography schemes
Abstract. Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper ...
متن کاملExtended Schemes for Visual Cryptography
An extended visual cryptography scheme, (? Qual ; ? Forb ; m)-EVCS for short, with pixel \expansion" m, for an access structure (? Qual ; ? Forb) on a set of n participants, is a technique to encode n innocent looking images in such a way that when we stack together the transparencies associated to participants in any set X 2 ? Qual we get the secret message with no trace of the original images...
متن کاملOn the Analysis and Generalization of Extended Visual Cryptography Schemes
An Extended Visual Cryptography Scheme (EVCS) was proposed by Ateniese et al. [3] to protect a binary secret image with meaningful (innocent-looking) shares. This is implemented by concatenating an extended matrix to each basis matrix. The minimum size of the extended matrix was obtained from a hypergraph coloring model and the scheme was designed for binary images only [3]. In this paper, we g...
متن کاملProbabilistic Visual Cryptography Schemes
Visual cryptography schemes allow the encoding of a secret image, consisting of black or white pixels, inton shares which are distributed to the participants. The shares are such that only qualified subsets of participants can ‘visually’ recover the secret image. The secret pixels are shared with techniques that subdivide each secret pixel into a certain number m, m ≥ 2 of subpixels. Such a par...
متن کاملExtended visual cryptography systems
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper we study e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.12.005